Super d-anti-magic labeling of subdivided $kC_{5}$

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Super edge-magic total labeling of subdivided stars

An edge-magic total labeling of a graph G is a one-toone map λ from V (G) ∪ E(G) onto the integers {1, 2, · · · , |V (G) ∪ E(G)|} with the property that, there is an integer constant c such that λ(x) + λ(x, y) + λ(y) = c for any (x, y) ∈ E(G). If λ(V (G)) = {1, 2, · · · , |V (G|} then edge-magic total labeling is called super edgemagic total labeling. In this paper, we formulate super edge-magi...

متن کامل

On super edge-antimagic total labeling of subdivided stars

In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super (a, d)edge-antimagic total labelings on a subclass of subdivided stars denoted by T (n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edgeantimagic labeling...

متن کامل

On anti-magic labeling for graph products

An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that the vertex sums are pairwise distinct, where the vertex sum at one vertex is the sum of labels of all edges incident to such vertex. A graph is called anti-magic if it admits an anti-magic labeling. Hartsfield and Ringel c...

متن کامل

On super edge-magic total labeling on subdivision of trees

An edge-magic total labeling of a graph G is a one-toone map λ from V (G) ∪ E(G) onto the integers {1, 2, · · · , |V (G) ∪ E(G)|} with the property that, there is an integer constant c such that λ(x) + λ(x, y) + λ(y) = c for any (x, y) ∈ E(G). If λ(V (G)) = {1, 2, · · · , |V (G|} then edge-magic total labeling is called super edgemagic total labeling. In this paper we formulate super edge-magic...

متن کامل

On super edge-magic total labeling of banana trees

Let G1, G2, ..., Gn be a family of disjoint stars. The tree obtained by joining a new vertex a to one pendant vertex of each star Gi is called a banana tree. In this paper we determine the super edge-magic total labelings of the banana trees that have not been covered by the previous results [15].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS

سال: 2015

ISSN: 1300-0098,1303-6149

DOI: 10.3906/mat-1501-45